2D ELEMENTARY CELLULAR AUTOMATA WITH FOUR NEIGHBORS
نویسندگان
چکیده
منابع مشابه
2D Elementary Cellular Automata with Four Neighbors
This paper is concerned with the study of square boolean synchronous four-neighbor peripheral cellular automata. It is first shown that, due to conjugation and plane reflection symmetry transformations, the number of dynamically nonequivalent such automata is equal to 4 856. The cellular automata for which the homogeneous final states play a significant role are then identified. Finally, it is ...
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملElementary Cellular Automata with Memory
Standard cellular automata (CA) are ahistoric (memoryless), that is, the new state of a cell depends on the neighborhood configuration of only the preceding time step. This article introduces an extension to the standard framework of CA by considering automata with memory capabilities. While the update rules of the CA remain unaltered, a history of all past iterations is incorporated into each ...
متن کاملSimulating 3D Cellular Automata with 2D Cellular Automata
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise when changing the dimension, propose solutions and discuss the main properties of the obtained simulation.
متن کاملUniversality in Elementary Cellular Automata
The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular sequence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Bifurcation and Chaos
سال: 2013
ISSN: 0218-1274,1793-6551
DOI: 10.1142/s0218127413500600